| 1. | Converting infix expression to a postfix expression
中缀表达式到后缀表达式的转换 |
| 2. | Parsing an infix expression
对中缀表达式进行语法分析 |
| 3. | Read the infix expression from left to right , one character at a time
从左到右读入中缀表达式，每次一个字符。 |
| 4. | Evaluating a postfix expression is simpler than directly evaluating an infix expression
对后缀表达式求值比直接对中缀表达式求值简单。 |
| 5. | The operands are in the same order that they would be in the equivalent infix expression
操作数的顺序与等价的中缀表达式中操作数的顺序一致 |
| 6. | It does not convert infix expressions to postfix notation ; rather , it evaluates the infix expression directly
不是把中缀表达式转换为后缀表示法；恰恰相反，它对中缀表达式直接求值。 |
| 7. | The conversion process involves reading the operands , operators , and parentheses of the infix expression using the following algorithm
转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号： |
| 8. | To convert an expression in an infix expression to its equivalent in postfix notation , we must know the precedence and associativity of operators
要把表达式从中缀表达式的形式转换成用后缀表示法表示的等价表达式，必须了解操作符的优先级和结合性。 |
